Non - Separable Cryptographic Functions
نویسندگان
چکیده
We study nonlinear Boolean functions that are used in cryptography, especially in block and stream ciphers. We point out possible cryptographic weaknesses of the so-called separable functions. A characteristic of these functions is that they can be transformed into ones that are composed of two “sub-functions” with disjoint variables. We then proceed to construct non-separable functions that exhibit additional useful cryptographic properties such as balance, high nonlinearity, correlation immunity, and good propagation characteristics.
منابع مشابه
Dynamic MDS Matrices for Substantial Cryptographic Strength
Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers. In block ciphers diffusion is achieved by the use of Maximum Distance Separable (MDS) matrices. In this paper we present some methods for constructing dynamic (and r...
متن کاملLightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملBand-limited Wavelets and Framelets in Low Dimensions
In this paper, we study the problem of constructing non-separable band-limited wavelet tight frames, Riesz wavelets and orthonormal wavelets in R and R. We first construct a class of non-separable band-limited refinable functions in low-dimensional Euclidean spaces by using univariate Meyer’s refinable functions along multiple directions defined by classic box-spline direction matrices. These n...
متن کاملEvolutionary design of domain specific non-cryptographic hash functions
Hash functions are inseparable part of modern computer world. Fast associative arrays so popular among computer programmers for their robustness and simplicity, are based on them. Their performance greatly depends on their design and although their roots are deep in the past, the topic of designing a well performing hash function is still often discussed today. There is currently a plenty of ex...
متن کاملPassive Dendrites Enable Single Neurons to Compute Linearly Non-separable Functions
Local supra-linear summation of excitatory inputs occurring in pyramidal cell dendrites, the so-called dendritic spikes, results in independent spiking dendritic sub-units, which turn pyramidal neurons into two-layer neural networks capable of computing linearly non-separable functions, such as the exclusive OR. Other neuron classes, such as interneurons, may possess only a few independent dend...
متن کامل